Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
نویسندگان
چکیده
In this paper, quantified Horn formulas with free variables (QHORN∗) are investigated. The main result is that any quantified Horn formula Φ of length |Φ| with free variables, |∀| universal quantifiers and an arbitrary number of existential quantifiers can be transformed into an equivalent formula of length O(|∀| · |Φ|) which contains only existential quantifiers. Moreover, it is shown that quantified Horn formulas with free variables have equivalence models where every existential quantifier is associated with a monotone Boolean function. The results allow a simple representation of quantified Horn formulas as purely existentially quantified Horn formulas (∃HORN∗). An application described in the paper is to solve QHORN∗-SAT in O(|∀| · |Φ|) by using this transformation in combination with a linear-time satisfiability checker for propositional Horn formulas.
منابع مشابه
Models and quantifier elimination for quantified Horn formulas
In this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. Accordingly, we give a detailed characterization of QHORN satisfiability models which describe the set of satisfying truth assignments to the existential variables. We also conside...
متن کاملRewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
We extend quantified 2-CNF formulas by also allowing literals over free variables which are exempt from the 2-CNF restriction. That means we consider quantified CNF formulas with clauses that contain at most two bound literals and an arbitrary number of free literals. We show that these Q2-CNF formulas can be transformed in polynomial time into purely existentially quantified CNF formulas in wh...
متن کاملEarly Steps of Second-Order Quantifier Elimination beyond the Monadic Case: The Correspondence between Heinrich Behmann and Wilhelm Ackermann 1928-1934 (Abstract)
This presentation focuses on the span between two early seminal papers on second-order quantifier elimination on the basis of first-order logic: Heinrich Behmann’s Habilitation thesis Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem (Contributions to the algebra of logic, in particular to the decision problem), published in 1922 as [4], and Wilhelm Ackermann’s Untersuchunge...
متن کاملTransformations into Normal Forms for Quantified Circuits
We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...
متن کاملHeinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic
For relational monadic formulas (the Löwenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting – operations that currently receive much attention in knowledge processing – always succeeds. The decidability proof for this class by Heinrich Behmann from 1922 explicitly proceeds by elimination with equivalence p...
متن کامل